2. The Problems We Consider
نویسنده
چکیده
The Cauchy-Davenport theorem states that for any two nonempty subsets A andB of Z/pZ we have |A + B| ≥ min{p, |A| + |B| − 1}, where A + B := {a + bmod p | a ∈ A, b ∈ B}. We generalize this result from Z/pZ to arbitrary finite(including non-abelian) groups. This result from early in 2006 is independent ofGyula Károlyi’s 2005 result in [13] and uses different methods.
منابع مشابه
Convex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
متن کاملAugmented Lagrangian method for solving absolute value equation and its application in two-point boundary value problems
One of the most important topic that consider in recent years by researcher is absolute value equation (AVE). The absolute value equation seems to be a useful tool in optimization since it subsumes the linear complementarity problem and thus also linear programming and convex quadratic programming. This paper introduce a new method for solving absolute value equation. To do this, we transform a...
متن کاملNew classes of Lyapunov type inequalities of fractional $Delta$-difference Sturm-Liouville problems with applications
In this paper, we consider a new study about fractional $Delta$-difference equations. We consider two special classes of Sturm-Liouville problems equipped with fractional $Delta$-difference operators. In couple of steps, the Lyapunov type inequalities for both classes will be obtained. As application, some qualitative behaviour of mentioned fractional problems such as stability, ...
متن کاملNon-Lipschitz Semi-Infinite Optimization Problems Involving Local Cone Approximation
In this paper we study the nonsmooth semi-infinite programming problem with inequality constraints. First, we consider the notions of local cone approximation $Lambda$ and $Lambda$-subdifferential. Then, we derive the Karush-Kuhn-Tucker optimality conditions under the Abadie and the Guignard constraint qualifications.
متن کاملتوسعهی مفهوم پزشکیزدگی: بیمار یا مشتری، حقیقت یا آرزو، سلامتی یا سوداگری
"Medicalization" occurs when the non-medical issues are defined and treated in the medical field. The purpose of this study was to develop the concept of medicalization and the transition of the concept from patient to the customer, truth to wishes and treatment to trading. The study is a review research conducted through reviewing the library and electronic resources to develop medicalization’...
متن کاملLocation problems in regions with and block norms
We consider the two well knownminimax and minisum single facility location problems in the plane which has been divided into two regions, and by a straight line. The two regions are measured by various norms . We focus on three special cases in which the regions and are measured by and norms, and block norms, two distinct block norms. Based on the properties of block norms then we use linear ...
متن کامل